Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets
نویسنده
چکیده
We prove that coverability and termination are not primitive-recursive for lossy counter machines and for Reset Petri nets.
منابع مشابه
Lossy Counter
We consider lossy counter machines, i.e. counter machines with counters whose contents can spontaneously decrease at any time. They are not Turing-powerful, since reachability is decidable for them, but they still have interesting undecidable properties: For a lossy counter machine it is undecidable if there exists an initial connguration s.t. there is an innnite run. Lossy counter machines can...
متن کاملUndecidable Problems in Unreliable Computations
Department of Computer Science, University of Edinburgh, JCMB, Edinburgh EH9 3JZ, UK. e-mail: [email protected] Abstract. Lossy counter machines are defined as Minsky n-counter machines where the values in the counters can spontaneously decrease at any time. While termination is decidable for lossy counter machines, structural termination (termination for every input) is undecidable. This und...
متن کاملWhat Makes Petri Nets Harder to Verify: Stack or Data?
We show how the yardstick construction of Stockmeyer, also developed as counter bootstrapping by Lipton, can be adapted and extended to obtain new lower bounds for the coverability problem for two prominent classes of systems based on Petri nets: Ackermann-hardness for unordered data Petri nets, and Tower-hardness for pushdown vector addition systems.
متن کاملBisimulation equivalence of first-order grammars is Ackermann-hard
Bisimulation equivalence (or bisimilarity) of first-order grammars is decidable, as follows from the decidability result by Sénizergues (1998, 2005) that has been given in an equivalent framework of equational graphs with finite out-degree, or of pushdown automata (PDA) with only deterministic and popping ε-transitions. Benedikt, Göller, Kiefer, and Murawski (2013) have shown that the bisimilar...
متن کاملAnalysis of Self-Stabilization for Infinite-State Systems
For a variety of infinite-state systems, the problem of deciding whether a given system is self-stabilizing or not is investigated from the decidability viewpoint. We develop a unified strategy through which checking self-stabilization is shown to be decidable for lossy vector addition systems with states, one-counter machines, and conflict-free Petri nets. For lossy counter machines and lossy ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010